A successful concept for measuring non-planarity of graphs: the crossing number

نویسنده

  • László A. Székely
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond-Planarity: Density Results for Bipartite Graphs

Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani [14]) for extremal problems on geometric graphs, but is also related to graph drawing problems ...

متن کامل

Crossings in clustered level graphs

Clustered graphs are an enhanced graph model with a recursive clustering of the vertices according to a given nesting relation. This prime technique for expressing coherence of certain parts of the graph is used in many applications, such as biochemical pathways and UML class diagrams. For directed clustered graphs usually level drawings are used, leading to clustered level graphs. In this thes...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

The projective plane crossing number of the circulant graph C(3k;{1, k})

The crossing number is an important measure of the non-planarity of a graph. Bhatt and Leighton [1] showed that the crossing number of a network (graph) is closely related to the minimum layout area required for the implementation of a VLSI circuit for that network. In general, determining the crossing number of a graph is hard. Garey and Johnson [3] showed that it is NP-complete. In fact, Hlin...

متن کامل

The Structure of Unitary Cayley Graphs

In this paper we explore structural properties of unitary Cayley graphs, including clique and chromatic number, vertex and edge connectivity, planarity, and crossing number.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 276  شماره 

صفحات  -

تاریخ انتشار 2000